Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
نویسندگان
چکیده
منابع مشابه
Asymptotics for Sparse Exponential Random Graph Models
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain a variational principle for the limiting free energy, an associated concentration of measure, the asymptotics for the mean and variance of the limiting probability distribution, and phase transitions in the edge-triangle model. Similar analysis is...
متن کاملExponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملThe degree sequence of a random graph. I. The models
We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand we consider the distribution of degree sequences of random graphs with n vertices and 1 2 m edges. For a wide range of values of m, this distribution is almost everywhere in close correspondence wi...
متن کاملAdvances in exponential random graph (p*) models
Editorial Advances in exponential random graph (p *) models Statistical approaches to social networks have a rather long history. Few now recall that Moreno and Jennings (1938) in the very first edition of Sociometry compared an observed network against a null distribution of graphs to investigate the prevalence of what they called social configurations (long before the much later terms motif o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2016
ISSN: 0090-5364
DOI: 10.1214/15-aos1343